Lexicographic codes: Error-correcting codes from game theory

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lexicographic codes: Error-correcting codes from game theory

A~.~hslruct-Lexicographic codes, or lexicodes, are defined by various versions of the greedy algorithm. The theory of these codes is closely related to the theory of certain impartial games, which leads to a number of surprising properties. For example, lexicodes over an alphabet of size B = 2” are closed under addition;’ while if B = 22u the lexicodes are closed under multiplication by scalars...

متن کامل

Theory of Error - Correcting Codes

The field of channel coding started with Claude Shannon’s 1948 landmark paper. Fifty years of efforts and invention have finally produced coding schemes that closely approach Shannon’s channel capacity limit on AWGN channels, both power-limited and band-limited. Similar gains are being achieved in other important applications, such as wireless channels. This course is divided in two parts. In t...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

Hamming codes and some theory of linear error correcting codes

The topic is how to reduce the error of communication in the presence of noise. Block encoding is an expansion function from a block of plaintext alphabet symbols to a block of communication alphabet symbols where the block lengths are k and n respectively, and k ≤ n. Without loss of generality we consider both alphabets to be bit strings. The notation for an i length bit string is σ ∈ { 0, 1 }...

متن کامل

Error Correcting Codes in Quantum Theory.

A new type of uncertainty relation is presented, concerning the information-bearing properties of a discrete quantum system. A natural link is then revealed between basic quantum theory and the linear error correcting codes of classical information theory. A subset of the known codes is described, having properties which are important for error correction in quantum communication. It is shown t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 1986

ISSN: 0018-9448

DOI: 10.1109/tit.1986.1057187